On Vince Vatter’s Brilliant Extension of Doron Zeilberger’s Enumeration Schemes for Herb Wilf ’s Classes

نویسندگان

  • Doron ZEILBERGER
  • Mireille Bousquet-Mélou
چکیده

Zeilberger’s original approach My original approach was to teach the computer some elementary ‘logical reasoning’, and find enumeration schemes that way. This was done in a Maple package (still available from my website) called WILF. To check the ‘logical’ program, I also wrote an empirical program, called HERB. The Maple package HERB found enumeration schemes by testing them for permutations of size n ≤ N0, where N0 was some positive integer chosen by the user. But to rigorously prove the validity of the candidate enumeration schemes we still need the ‘logical’ program WILF, since the empirical program, HERB, is just that, empirical! OR IS IT?.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

2 7 M ay 1 99 8 ENUMERATION SCHEMES AND , MORE IMPORTANTLY , THEIR AUTOMATIC GENERATION

It is way too soon to teach our computers how to become full-fledged humans. It is even premature to teach them how to become mathematicians, it is even unwise, at present, to teach them how to become combinatorialists. But the time is ripe to teach them how to become experts in a suitably defined and narrowly focused subarea of combinatorics. In this article, I will describe my efforts to teac...

متن کامل

Enumeration Schemes for Restricted Permutations

Zeilberger’s enumeration schemes can be used to completely automate the enumeration of many permutation classes. We extend his enumeration schemes so that they apply to many more permutation classes and describe the Maple package WilfPlus, which implements this process. We also compare enumeration schemes to three other systematic enumeration techniques: generating trees, substitution decomposi...

متن کامل

Three Recitations on Holonomic Systems and Hypergeometric Series

When we teach calculus we have lectures and recitations. These notes are meant as “recitations” or something like “Schaum outlines” for the theory. The role of the “lectures” or “textbook” is provided by Gosper’s path-breaking paper “A Decision Procedure for Indefinite summation”, Proc. Nat. Acad. Sci. USA 75 (1978), 40-42, and by the following papers by myself and my collaborators, Gert Almkvi...

متن کامل

The Markov-WZ Method

Andrei Markov’s 1890 method for convergence-acceleration of series bears an amazing resemblance to WZ theory, as was recently pointed out by M. Kondratieva and S. Sadov. But Markov did not have Gosper and Zeilberger’s algorithms, and even if he did, he wouldn’t have had a computer to run them on. Nevertheless, his beautiful ad-hoc method, when coupled with WZ theory and Gosper’s algorithm, lead...

متن کامل

A General Theory of Wilf-Equivalence for Catalan Structures

The existence of apparently coincidental equalities (also called Wilf-equivalences) between the enumeration sequences or generating functions of various hereditary classes of combinatorial structures has attracted significant interest. We investigate such coincidences among non-crossing matchings and a variety of other Catalan structures including Dyck paths, 231-avoiding permutations and plane...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999